Low Complexity Decoding Algorithm for Uplink SCMA Based on Aerial Spherical Decoding

نویسندگان

چکیده

As a new non-orthogonal multiple access technology for 5G massive machine type communication scenario, the sparse code (SCMA) has greatly improved spectrum efficiency due to high connection density. SCMA combines QAM (Quadrature Amplitude Modulation) modulation and spreading into codebook set obtain forming gain. The user binary bit data is directly mapped multi-dimensional codewords in transmitter. receiver uses message passing algorithm (MPA) multi-user detection achieve efficient decoding. However, MPA good solution SCMA, though its complexity limits application practical systems. In order reduce of MPA, this paper proposed low-complexity decoding based on serial spherical (SSD-MPA), which enhanced practicability system. SSD-MPA took account distribution characteristics Gaussian noise reliability constellation points, only updates trusted point messages nodes within radius. At same time, it used strategy speed up convergence rate. simulation results have shown that when radius sets properly, reduces by about 2/3 compared with original performance was almost lossless.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Search Based Weighted Multi-Bit Flipping Algorithm for High-Performance Low-Complexity Decoding of LDPC Codes

In this paper, two new hybrid algorithms are proposed for decoding Low Density Parity Check (LDPC) codes. Original version of the proposed algorithms named Search Based Weighted Multi Bit Flipping (SWMBF). The main idea of these algorithms is flipping variable multi bits in each iteration, change in which leads to the syndrome vector with least hamming weight. To achieve this, the proposed algo...

متن کامل

Search Based Weighted Multi-Bit Flipping Algorithm for High-Performance Low-Complexity Decoding of LDPC Codes

In this paper, two new hybrid algorithms are proposed for decoding Low Density Parity Check (LDPC) codes. Original version of the proposed algorithms named Search Based Weighted Multi Bit Flipping (SWMBF). The main idea of these algorithms is flipping variable multi bits in each iteration, change in which leads to the syndrome vector with least hamming weight. To achieve this, the proposed algo...

متن کامل

A Low Complexity Detection Algorithm for SCMA

Sparse code multiple access (SCMA) is a new multiple access technique which supports massive connectivity. Compared with the current Long Term Evolution (LTE) system, it enables the overloading of active users on limited orthogonal resources and thus meets the requirement of the fifth generation (5G) wireless networks. However, the computation complexity of existing detection algorithms increas...

متن کامل

Low Complexity Turbo Decoding

In this paper a truncated turbo decoding with reduced computational complexity is proposed. In the course of iterative decoding, bits are detected that will be changed very unlikely in the current iteration step. These bits are excluded from decoding (in the current iteration step) which yields a turbo decoding with much lower complexity while the loss of bit error rate (BER) is quiet small.

متن کامل

Low complexity algorithm for soft decoding of convolutional codes

It is well known that convolutional codes can be optimally decoded by the Viterbi Algorithm (VA). We propose a soft decoding technique where the VA is applied to identify the error vector rather than the information message. In this paper, we show that, with this type of decoding, the exhaustive computation of a vast majority of state to state iterations is unnecessary. Hence, performance close...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Intelligent Automation and Soft Computing

سال: 2021

ISSN: ['2326-005X', '1079-8587']

DOI: https://doi.org/10.32604/iasc.2021.013009